全文获取类型
收费全文 | 154篇 |
免费 | 37篇 |
国内免费 | 4篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 5篇 |
2019年 | 5篇 |
2018年 | 9篇 |
2017年 | 18篇 |
2016年 | 18篇 |
2015年 | 2篇 |
2014年 | 11篇 |
2013年 | 18篇 |
2012年 | 12篇 |
2011年 | 9篇 |
2010年 | 9篇 |
2009年 | 15篇 |
2008年 | 8篇 |
2007年 | 10篇 |
2006年 | 9篇 |
2005年 | 9篇 |
2004年 | 2篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1999年 | 1篇 |
1996年 | 1篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1990年 | 1篇 |
排序方式: 共有195条查询结果,搜索用时 517 毫秒
81.
自组网中的分布式多节点资源分配问题为NP完全问题,一般采用启发式算法进行协议设计,缺少严格的数学证明.基于博弈与纳什议价解理论,提出了一种分布式动态时隙分配策略,并通过严格的数学推导,证明了自组网中不同节点之间的时隙竞争问题存在纳什议价解,为自组网中分布式动态时分多址信道访问控制协议的设计提供了理论依据. 相似文献
82.
装备采购委托代理关系分析 总被引:9,自引:1,他引:8
针对目前采用的委托方对代理方的激励与约束机制设计,利用博弈论方法分析了监督策略成本会引起最优解迁移,并以实例予以了说明.同时,给出了军事经济效能观测指标的选择原则和多行动代理方的激励机制设计原则. 相似文献
83.
基于梯度迭代法的一类追逃对抗模型研究 总被引:3,自引:0,他引:3
针对一类追逃对抗问题,基于微分对策理论,建立了三维空间中的追逃对抗模型,进而得到了最优性条件和最优策略.运用梯度迭代法给出了模型的数值解,并做了实例分析.分析结果显示,该模型可以很好地应用于潜艇对潜艇、潜艇对水面舰艇等实际追逃对抗问题. 相似文献
84.
We study markets for surplus components, which allow manufacturers with excess component inventory to sell to firms with a shortage. Recent developments in internet commerce have the potential to greatly increase the efficiency of such markets. We develop a one‐period model in which a monopolist supplier sells to a number of independent manufacturers who are uncertain about demand for final goods. After uncertainty is resolved, the manufacturers have the opportunity to trade. Because uncertainty is over demand functions, the model allows us to endogenize both the price of final goods and the price of components in wholesale and surplus markets. We derive conditions on demand uncertainty that determine whether a surplus market will increase or decrease supplier profits. Increased costs of transacting on the surplus market may benefit manufacturers, because of the impact of these costs on the supplier's pricing power. The surplus market can decrease overall efficiency of the supply chain, since the benefit of better allocation of components may be outweighed by an increased double‐marginalization effect. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
85.
In this paper we present an application of the core solution concepts for multi‐objective games to a bank ATM network model. In these games, the worth of a coalition is given by a subset of vectors of the k‐dimensional space rather than by a scalar. The paper investigates how an ATM network model based on multi‐objective cooperative game theory could be used as an alternative way of setting interchange fees paid by the customer's bank to the one that owns the ATM. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
86.
Problems in counterterrorism and corporate competition have prompted research that attempts to combine statistical risk analysis with game theory in ways that support practical decision making. This article applies these methods of adversarial risk analysis to the problem of selecting a route through a network in which an opponent chooses vertices for ambush. The motivating application is convoy routing across a road network when there may be improvised explosive devices and imperfect intelligence about their locations. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
87.
We develop models that lend insight into how to design systems that enjoy economies of scale in their operating costs, when those systems will subsequently face disruptions from accidents, acts of nature, or an intentional attack from a well‐informed attacker. The systems are modeled as parallel M/M/1 queues, and the key question is how to allocate service capacity among the queues to make the system resilient to worst‐case disruptions. We formulate this problem as a three‐level sequential game of perfect information between a defender and a hypothetical attacker. The optimal allocation of service capacity to queues depends on the type of attack one is facing. We distinguish between deterministic incremental attacks, where some, but not all, of the capacity of each attacked queue is knocked out, and zero‐one random‐outcome (ZORO) attacks, where the outcome is random and either all capacity at an attacked queue is knocked out or none is. There are differences in the way one should design systems in the face of incremental or ZORO attacks. For incremental attacks it is best to concentrate capacity. For ZORO attacks the optimal allocation is more complex, typically, but not always, involving spreading the service capacity out somewhat among the servers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
88.
89.
90.
基于二人有限零和对策的防空兵火力分配方法 总被引:1,自引:0,他引:1
为了优化防空作战过程中火力分配问题,使射击达到最佳效果,运用对策论、线性规划等理论方法,采用对策矩阵建立了防空火力分配的线性规划模型,并通过计算示例和计算机仿真初步预测了敌方的空袭兵器使用情况和我方相应的兵力分配对策。该模型建立的防空火力分配方法较好地满足了要地防空装备的战术应用问题,对提高作战效能具有一定的参考价值。 相似文献